A Markov-Based Intrusion Tolerance Finite Automaton
نویسندگان
چکیده
It is inevitable for networks to be invaded during operation. The intrusion tolerance technology comes into being enable provide the necessary network services. This paper introduces an automatic learning mechanism of system update security strategy, and derives finite automaton model from existing model. proposed was quantified by Markov theory compute stable probability each state. calculated probabilities theoretical guidance basis administrators better safeguard security. Verification results show that it feasible, effective, convenient integrate automaton.
منابع مشابه
Intrusion Detection Using Evolutionary Hidden Markov Model
Intrusion detection systems are responsible for diagnosing and detecting any unauthorized use of the system, exploitation or destruction, which is able to prevent cyber-attacks using the network package analysis. one of the major challenges in the use of these tools is lack of educational patterns of attacks on the part of the engine analysis; engine failure that caused the complete training, ...
متن کاملAnalysis and Optimization of System Intrusion Tolerance Capacity Based on Markov
After the occurrence of network intrusion, the system is running in a state of the lower quality. Along with the system’s tolerant capacity decline, it eventually stops providing services or even shutdown. This paper developed a Markov intrusion tolerance model (SMP), aiming at difficultly evaluates and enhances the system’s tolerant capacity issues. Based on formalized related security state o...
متن کاملIntrusion Detection Based on Hidden Markov Model
The intrusion detection technologies of the network security are researched, and the tec<nologies of pattern recognition are used to intrusion detection. lnhusion detection rely on a wide variety of observable data to distinguish between legitimate and illegitimate activities. Hidden Markov Model (HMM) has been successfully used in speech recognition and some classification areas. Since Anomaly...
متن کاملThe Nondeterministic Complexity of a Finite Automaton
We deene the nondeterministic complexity of a nite automaton and show that there exist, for any integer p 1, automata which need (k 1=p) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid into a hierarchy whose members are indexed by polynomials, where M denotes the Min{Plus semiring.
متن کاملSampling a Two-way Finite Automaton
We study position sampling in a two-way nondeterministic finite automaton (2NFA) to measure information flow between state variables, based on the information-theoretic sampling technique proposed in [20]. We prove that for a 2NFA, the language generated by position sampling is regular. We also show that for a 2NFA, we can effectively find a vector of sampling positions that maximizes informati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2021
ISSN: ['1846-3908', '1330-1136']
DOI: https://doi.org/10.20532/cit.2020.1005178